Parallel Computing Using the Prefix Problem
نویسندگان
چکیده
منابع مشابه
Parallel computing using the prefix problem
Spend your time even for only few minutes to read a book. Reading a book will never reduce and waste your time to be useless. Reading, for some people become a need that is to do every day such as spending time for eating. Now, what about you? Do you like to read a book? Now, we will show you a new book enPDFd parallel computing using the prefix problem that can be a new way to explore the know...
متن کاملParallel Algorithms for Computing Linked List Prefix
Given a linked list x1, x2, ..., xn with xi following xi−1 in the list and an associative operation ©, the linked list prefix problem is to compute all prefixes ©ji=1xi, j = 1, 2, ..., n. In this paper we study the linked list prefix problem on parallel computation models. A deterministic algorithm for computing a linked list prefix on a completely connected parallel computation model is obtain...
متن کاملComputing Covers Using Prefix Tables
An indeterminate string x = x[1..n] on an alphabet Σ is a sequence of nonempty subsets of Σ; x is said to be regular if every subset is of size one. A proper substring u of regular x is said to be a cover of x iff for every i ∈ 1..n, an occurrence of u in x includes x[i]. The cover array γ = γ[1..n] of x is an integer array such that γ[i] is the longest cover of x[1..i]. Fifteen years ago a com...
متن کاملThe Average Case Complexity of the Parallel Prefix Problem
We analyse the average case complexity of evaluating all preexes of an input vector over a given semigroup. As computational model circuits over the semigroup are used and a complexity measure for the average delay of such circuits, called time, is introduced. Based on this notion, we then deene the average case complexity of a computational problem for arbitrary input distributions. For highly...
متن کاملParallel Biological Sequence Comparison Using Prefix Computations
We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and affine gap penalty functions, full-sequence and subsequence matching, and space-saving algorithms. The best known sequential algorithms solve these problems in O(mn) time and O(m + n) space, where m and n are the lengths...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1995
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/38.3.264-a